In mathematics, the Jack function, introduced by Henry Jack, is a homogenous, symmetric polynomial which generalizes the Schur and zonal polynomials, and is in turn generalized by the Heckman–Opdam polynomials and Macdonald polynomials.
Contents |
The Jack function of integer partition , parameter and arguments can be recursively defined as follows:
where the summation is over all partitions such that the skew partition is a horizontal strip, namely
where equals if and otherwise. The expressions and refer to the conjugate partitions of and , respectively. The notation means that the product is taken over all coordinates of boxes in the Young diagram of the partition .
The Jack functions form an orthogonal basis in a space of symmetric polynomials. This orthogonality property is unaffected by normalization. The normalization defined above is typically referred to as the J normalization. The C normalization is defined as
where
For denoted often as just is known as the Zonal polynomial.
When the Jack function is a scalar multiple of the Schur polynomial
where
is the product of all hook lengths of .
If the partition has more parts than the number of variables, then the Jack function is 0:
In some texts, especially in random matrix theory, authors have found it more convenient to use a matrix argument in the Jack function. The connection is simple. If is a matrix with eigenvalues , then